Colouring Proofs: A Lightweight Approach to Adding Formal Structure to Proofs

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Colouring Proofs: A Lightweight Approach to Adding Formal Structure to Proofs

In this paper we propose a proof format to write formal proofs motivated by a formalisation of floating-point numbers. This proof format aims at being adequate for both proof presentation and mechanised proof checking. We also present a simple graphical interface to support this proof format.

متن کامل

A tool to practice formal proofs

This paper presents a Logic Tutor, a tool to support computer science students in their learning of logic, more specifically in their learning of formal proofs. The current tool is equipped with a deduction system for propositional logic. However its modular conception makes it easy to change to another logic. Preliminary evaluation shows that this tool has a high educational value, thanks, amo...

متن کامل

Lightweight Polymorphic Effects - Proofs

This technical report presents the full proofs for the type preservation and effect soundness theorems of the type system presented in the article “Lightweight Polymorphic Effects”.

متن کامل

Lightweight Delegatable Proofs of Storage

Proofs of storage (including Proofs of Retrievability and Provable Data Possession) is a cryptographic tool, which enables data owner or third party auditor to audit integrity of data stored remotely in a cloud storage server, without keeping a local copy of data or downloading data back during auditing. We observe that all existing publicly verifiable POS schemes suffer from a serious drawback...

متن کامل

Formal Security Proofs

The goal of the lecture is to present some aspects of formal security proofs of protocols. This is a wide area, and there is another lecture (by B. Banchet) on related topics. The idea is therefore to explain in depth one particular technique, that relies on deducibility constraints. We rely mainly on two introductory documents [8,14]. Actually, the current notes are the beginning of [8]. Here ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Notes in Theoretical Computer Science

سال: 2004

ISSN: 1571-0661

DOI: 10.1016/j.entcs.2004.07.002